Debugging Program Code Using Implicative Dependencies
نویسنده
چکیده
Based on the technique for finding errors in new object intents a method of debugging source code is presented. This method is capable of finding strict implicative dependencies between lines of source code covered in successful and failed runs. The output is a logical expression. Using the new method it is possible to come closer to debugging programs on a logical level not checking executions line by line. An example of applying the new method is presented. Possibilities of further development are discussed.
منابع مشابه
Relationship between the Verification Based Model and the Functional Dependences Model Using Program Specification
It is generally agreed that faults are very difficult to find, and also expensive to locate and remove from programs. Hence, automating the debugging task is highly desired. This paper presents previous work in automated debugging based on a verification based model, which can detect and localize faults from programs using abstract dependencies. We empirically compare the two models, i.e., Func...
متن کاملThe Intelligent C Language Debugger
Most current programming debuggers do not have any built-in intelligence to help programmers perform debugging. When using these non-intelligent debuggers, programmers have to debug their programs statement by statement in order to track down the bugs. There are several disadvantages with the current non-intelligent debuggers. The first disadvantage is that the debugger does not know the variab...
متن کاملA new algorithm for the calculation of transitive dependences
Program slicing can be used to aid in a variety of software maintenance activities including code understanding, code testing, debugging, and program reengineering. Program slicing (as well as other program analysis functions including ripple analysis) can be efficiently performed on an internal program representation called a system dependence graph (SDG). This paper will describe a new method...
متن کاملA Statistical Implicative Analysis Based Algorithm and MMPC Algorithm for Detecting Multiple Dependencies
Discovering the dependencies among the variables of a domain from examples is an important problem in optimization. Many methods have been proposed for this purpose, but few large-scale evaluations were conducted. Most of these methods are based on measurements of conditional probability. The statistical implicative analysis offers another perspective of dependencies. It is important to compare...
متن کاملMultithreaded Dependence Graphs for Concurrent Java Programs
Understanding program dependencies in a computer program is essential for many software engineering activities including program slicing, testing, debugging, reverse engineering, and maintenance. In this paper, we present a dependence-based representation called multithreaded dependence graph, which extends previous dependence-based representations, to represent program dependencies in a concur...
متن کامل